On exponential ergodicity of multiclass queueing networks

On exponential ergodicity of multiclass queueing networks

One of the key performance measures in queueing systems is the exponential decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have finite moments, then the queue lengths also have finite moments, so that the tail probability P(· > s) decays faster than s−n for any n. It is natural to con...

FLUID APPROXIMATIONS AND STABILITY OF MULTICLASS QUEUEING NETWORKS: WORK-CONSERVING DISCIPLINES Running Head: Multiclass Queueing Networks

This paper studies the uid approximation (also known as the functional strong law-of-large-numbers) and the stability (positive Harris recurrent) for a multiclass queueing network. Both of these are related to the stabilities of a linear uid model, constructed from the rst-order parameters (i.e., long-run average arrivals, services and routings) of the queueing network. It is proved that the ui...

Simulation studies of multiclass queueing networks

Multiclass queueing networks have been used to model communication and complex manufacturing systems. Recent results have shown that these networks can be unstable in the sense that the total number of jobs in the network explodes as time tends to in®nity even if the trac intensity at each station is less than unity. Simulation is used to demonstrate these unusual phenomena. Conjectures based ...

Brownian Approximations of Multiclass Open-Queueing Networks

Dynamic Scheduling of Multiclass Queueing Networks

Acknowledgements I would like to express my sincere gratitude to my advisor, Professor Jim Dai for his direction, support and feedback. His genius, patience and deep insights make it a pleasure to work with him. I also acknowledge the help and support of the other members of my committee, Professors Georgia Tech, students and faculty, for their support and help. I would especially like to thank...